Combination of Constraint Solving Techniques: An Algebraic POint of View
نویسندگان
چکیده
In a previous paper we have introduced a method that allows one to combine decision procedures for uniiability in disjoint equa-tional theories. Lately, it has turned out that the prerequisite for this method to apply|namely that uniication with so-called linear constant restrictions is decidable in the single theories|is equivalent to requiring decidability of the positive fragment of the rst order theory of the equa-tional theories. Thus, the combination method can also be seen as a tool for combining decision procedures for positive theories of free algebras deened by equational theories. The present paper uses this observation as the starting point of a more abstract, algebraic approach to formulating and solving the combination problem. Its contributions are twofold. As a new result, we describe an optimization and an extension of our combination method to the case of constraint solvers that also take relational constraints (such as ordering constraints) into account. The second contribution is a new proof method, which depends on abstract notions and results from universal algebra, as opposed to technical manipulations of terms (such as ordered rewriting, abstraction functions, etc.)
منابع مشابه
The Sine-Cosine Wavelet and Its Application in the Optimal Control of Nonlinear Systems with Constraint
In this paper, an optimal control of quadratic performance index with nonlinear constrained is presented. The sine-cosine wavelet operational matrix of integration and product matrix are introduced and applied to reduce nonlinear differential equations to the nonlinear algebraic equations. Then, the Newton-Raphson method is used for solving these sets of algebraic equations. To present ability ...
متن کاملRobot Motion Vision Pait I: Theory
A direct method called fixation is introduced for solving the general motion vision problem, arbitrary motion relative to an arbitrary environment. This method results in a linear constraint equation which explicitly expresses the rotational velocity in terms of the translational velocity. The combination of this constraint equation with the Brightness-Change Constraint Equation solves the gene...
متن کاملAdvanced operations research techniques for multi-constraint QoS routing in internet
Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملComparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such constraints in termination tools is treating them as polynomial constraints. Several recent works develop connections between these problems and more standard constraint solving problems for which well-known and efficient...
متن کامل